Plain Fibring and Direct Union of Logics with Matrix Semantics

نویسندگان

  • Marcelo E. Coniglio
  • Víctor L. Fernández
چکیده

In this paper a variation of the fibred semantics of D. Gabbay called plain fibring is proposed, with the aim of combining logics given by matrix semantics. It is proved that the plain fibring of matrix logics is also a matrix logic. Moreover, it is proved that any logic obtained by plain fibring is a conservative extension of the original logics. It is also proposed a simpler version of plain fibring of matrix logics called direct union. This technique is applied to the study of the class of fuzzy logics defined by t-norms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Splitting Logics

This paper addresses the question of factoring a logic into families of (generally simpler) components, estimating the top– down perspective, splitting, versus the bottom–up, splicing. Three methods are carefully analyzed and compared: possible–translations semantics, nondeterministic semantics and plain fibring (joint with its particularization, direct union of matrices). The possibilities of ...

متن کامل

Fibring: Completeness Preservation

A completeness theorem is established for logics with congruence endowed with general semantics (in the style of general frames). As a corollary, completeness is shown to be preserved by fibring logics with congruence provided that congruence is retained in the resulting logic. The class of logics with equivalence is shown to be closed under fibring and to be included in the class of logics wit...

متن کامل

On Graph-theoretic Fibring of Logics

A graph-theoretic account of fibring of logics is developed, capitalizing on the interleaving characteristics of fibring at the linguistic, semantic and proof levels. Fibring of two signatures is seen as an m-graph where the nodes and the m-edges include the sorts and the constructors of the signatures at hand. Fibring of two models is an m-graph where the nodes and the m-edges are the values a...

متن کامل

Fibring (Para)consistent Logics∗

The problem of fibring paraconsistent logics is addressed. Such logics raise new problems in the semantics of fibring since previous work assumed verum-functional models. The solution is found in a general notion of interpretation system presentation that “specifies” the intended valuations in some appropriate meta language. Fibring appears as a universal construction in the category of interpr...

متن کامل

Fibring Logics with Topos Semantics

The concept of fibring is extended to higher-order logics with arbitrary modalities and binding operators. A general completeness theorem is established for such logics including HOL and with the meta-theorem of deduction. As a corollary, completeness is shown to be preserved when fibring such rich logics. This result is extended to weaker logics in the cases where fibring preserves conservativ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005